package com.leetcode.partition12;

/**
 * @author `RKC`
 * @date 2021/8/25 9:56
 */
public class LC1143最长公共子序列 {

    public static int longestCommonSubsequence(String text1, String text2) {
        return dynamicProgramming(text1, text2);
    }

    public static void main(String[] args) {
        String text1 = "abcde";
        String text2 = "ace";
        System.out.println(longestCommonSubsequence(text1, text2));
    }

    private static int dynamicProgramming(String text1, String text2) {
        //dp[i][j]表示text1[0,i)子串和text2(0,j)子串之间的最长公共子序列
        int[][] dp = new int[text1.length() + 1][text2.length() + 1];
        for (int i = 1; i <= text1.length(); i++) {
            for (int j = 1; j <= text2.length(); j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(Math.max(dp[i - 1][j], dp[i][j - 1]), dp[i - 1][j - 1]);
                }
            }
        }
        return dp[text1.length()][text2.length()];
    }
}
